Arcs, blocking sets, and minihypers
نویسندگان
چکیده
منابع مشابه
Blocking Sets , k - Arcs and Nets of Order Ten
Our first main objective here is to unify two important theories in finite geometries, namely, the theories of k-arcs and blocking sets. This has a number of consequences, which we develop elsewhere. However,one consequence that we do discuss here is an improvement of Bruck’s bound [ l] concerning the possibility of embedment of finite nets of order II, in the controversial case when n = 10. Th...
متن کاملMultiple blocking sets and arcs in finite planes
This paper contains two main results relating to the size of a multiple blocking set in PG(2, q). The first gives a very general lower bound, the second a much better lower bound for prime planes. The latter is used to consider maximum sizes of (k, n)-arcs in PG(2, 11) and PG(2, 13), some of which are determined. In addition, a summary is given of the value of mn(2, q) for q ≤ 13.
متن کاملTight sets, weighted m -covers, weighted m -ovoids, and minihypers
Minihypers are substructures of projective spaces introduced to study linear codes meeting the Griesmer bound. Recently, many results in finite geometry were obtained by applying characterization results on minihypers [8, 17, 18]. In this paper, using characterization results on certain minihypers, we present new results on tight sets in classical finite polar spaces and weighted m-covers, and ...
متن کاملBlocking and Double Blocking Sets in Finite Planes
In this paper, by using properties of Baer subplanes, we describe the construction of a minimal blocking set in the Hall plane of order q2 of size q2 + 2q + 2 admitting ∗This author has been supported as a postdoctoral fellow of the Research Foundation Flanders (Belgium) (FWO). †This author was supported by a Visiting Professor grant of the Special Research Fund Ghent University (BOF project nu...
متن کاملPetri Nets with Non-blocking Arcs are Difficult to Analyze
In this paper, we study the decidability of five problems on a class of extended Petri nets. The study of this class of extended Petri nets is motivated by the problem of parametric verification of multiple copies of processes that can communicate with a partially non-blocking rendez-vous. This kind of communications occurs in abstractions of multi-threaded JAVA programs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2000
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(00)00122-x